Bayesian Quickest Detection of Propagating Spatial Events
نویسندگان
چکیده
Rapid detection of spatial events that propagate across a sensor network is wide interest in many modern applications. In particular, communications, radar, IoT, environmental monitoring, and biosurveillance, we may observe propagating fields or particles. this paper, propose Bayesian sequential single multiple change-point procedures for the rapid such phenomena. Using dynamic programming framework derive structure optimal single-event quickest procedure, which minimizes average delay (ADD) subject to false alarm probability upper bound. The multi-sensor system configuration arbitrary sensors be mobile. rare event regime, procedure converges more practical threshold test on posterior change point. A convenient recursive computation derived by using propagation characteristics event. ADD analyzed asymptotic specific analysis conducted setting detecting random Gaussian signals affected path loss. Then, show how proposed easy extend parallel hypothesis testing setting. method provides strict discovery rate (FDR) control proposed. simulation section, it demonstrated exploiting properties decreases compared do not utilize information, even under model mismatch.
منابع مشابه
Bayesian Quickest Transient Change Detection
We consider the problem of quickest transient change detection under a Bayesian setting. The change occurs at a random time Γ1 and disappears at a random time Γ2 > Γ1. Thus, at any time k, the system can be in one of the following states, i) prechange, ii) in–change, and iii) out–of–change. We model the evolution of the state by a Markov chain. The state of the system can only be observed parti...
متن کاملBayesian Quickest Detection in Sensor Arrays
Abstract: We study Bayesian quickest detection problems with sensor arrays. An underlying signal is assumed to gradually propagate through a network of several sensors, triggering a cascade of inter-dependent change-points. The aim of the decision-maker is to centrally fuse all available information to find an optimal detection rule that minimizes Bayes risk. We develop a tractable continuous-t...
متن کاملGeneral Asymptotic Bayesian Theory of Quickest Change Detection
The optimal detection procedure for detecting changes in independent and identically distributed (i.i.d.) sequences in a Bayesian setting was derived by Shiryaev in the 1960s. However, the analysis of the performance of this procedure in terms of the average detection delay and false alarm probability has been an open problem. In this paper, we develop a general asymptotic change-point detectio...
متن کاملNon-Bayesian Quickest Detection with Stochastic Sample Right Constraints
In this paper, we study the design and analysis of optimal detection scheme for sensors that are deployed to monitor the change in the environment and are powered by the energy harvested from the environment. In this type of applications, detection delay is of paramount importance. We model this problem as quickest change detection problem with a stochastic energy constraint. In particular, a w...
متن کاملQuickest Moving Object Detection
We present a general framework and method for simultaneous detection and segmentation of an object in a video that moves (or comes into view of the camera) at some unknown time in the video. The method is an online approach based on motion segmentation, and it operates under dynamic backgrounds caused by a moving camera or moving nuisances. The goal of the method is to detect and segment the ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2022
ISSN: ['1053-587X', '1941-0476']
DOI: https://doi.org/10.1109/tsp.2022.3230334